Almost all triangle-free triple systems are tripartite
نویسندگان
چکیده
منابع مشابه
Almost all triangle-free triple systems are tripartite
A triangle in a triple system is a collection of three edges isomorphic to {123, 124, 345}. A triple system is triangle-free if it contains no three edges forming a triangle. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is triangle-free. We prove that almost all trian...
متن کاملAlmost all cancellative triple systems are tripartite
A triple system is cancellative if no three of its distinct edges satisfy A ∪ B = A ∪ C. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is cancellative. We prove that almost all cancellative triple systems with vertex set [n] are tripartite. This sharpens a theorem of N...
متن کاملAlmost all triple systems with independent neighborhoods are semi-bipartite
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a vertex subset X such that every edge of H intersects X in exactly two points. It is easy to see that if H is semi-bipartite, then the neighborhood of every pair of vertices in H is an independent set. We show a partial...
متن کاملAlmost all Steiner triple systems have perfect matchings
We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a un...
متن کاملOn the Chromatic Number of Simple Triangle-Free Triple Systems
A hypergraph is simple if every two edges share at most one vertex. It is trianglefree if in addition every three pairwise intersecting edges have a vertex in common. We prove that there is an absolute constant c such that the chromatic number of a simple triangle-free triple system with maximum degree ∆ is at most c √ ∆/ log ∆. This extends a result of Johansson about graphs, and is sharp apar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2012
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-012-2657-4